The Polynomial Multidimensional Szemerédi Theorem along Shifted Primes
نویسنده
چکیده
If ~q1, . . . , ~qm : Z → Z are polynomials with zero constant terms and E ⊂ Z has positive upper Banach density, then we show that the set E ∩ (E − ~q1(p− 1))∩ . . .∩(E−~qm(p−1)) is nonempty for some prime p. We also prove mean convergence for the associated averages along the prime numbers, conditional to analogous convergence results along the full integers. This generalizes earlier results of the authors, of Wooley and Ziegler, and of Bergelson, Leibman and Ziegler.
منابع مشابه
A Short Proof of the Multidimensional Szemerédi Theorem in the Primes
Tao conjectured that every dense subset of P, the d-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler. Here we give a simple proof using the Green-Tao theorem on linear equations in primes and the Furstenberg-Katznelson multidimensional Szemerédi theorem. Let PN denote the set of pr...
متن کاملA Relative Szemerédi Theorem
Abstract: The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. The proof has two parts. The first part is a relative Szemerédi theorem which says that any subset of a pseudorandom set of integers of positive relative density contains long arithmetic progressions, where a set is pseudorandom if it satisfies two conditions, the linear form...
متن کاملNumerical Solution of Interval Volterra-Fredholm-Hammerstein Integral Equations via Interval Legendre Wavelets Method
In this paper, interval Legendre wavelet method is investigated to approximated the solution of the interval Volterra-Fredholm-Hammerstein integral equation. The shifted interval Legendre polynomials are introduced and based on interval Legendre wavelet method is defined. The existence and uniqueness theorem for the interval Volterra-Fredholm-Hammerstein integral equations is proved. Some examp...
متن کاملToward a Hajnal-Szemerédi theorem for hypergraphs
Let H be a triple system with maximum degree d > 1 and let r > 107 √ d log d. Then H has a proper vertex coloring with r colors such that any two color classes differ in size by at most one. The bound on r is sharp in order of magnitude apart from the logarithmic factors. Moreover, such an r-coloring can be found via a randomized algorithm whose expected running time is polynomial in the number...
متن کاملIntersective polynomials and the polynomial Szemerédi theorem
Let P = {p1, . . . , pr} ⊂ Q[n1, . . . , nm] be a family of polynomials such that pi(Z) ⊆ Z, i = 1, . . . , r. We say that the family P has the PSZ property if for any set E ⊆ Z with d∗(E) = lim supN−M→∞ |E∩[M,N−1]| N−M > 0 there exist infinitely many n ∈ Zm such that E contains a polynomial progression of the form {a, a + p1(n), . . . , a + pr(n)}. We prove that a polynomial family P = {p1, . ...
متن کامل